An efficient time algorithm for makespan objectives

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Hybrid Genetic Algorithm for the Open Shop Scheduling with Makespan and Total Completion Time

Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified...

متن کامل

An efficient finite difference time domain algorithm for band structure calculations of Phononic crystal

In this paper, a new algorithm for studying elastic wave propagation in the phononic crystals is presented. At first, the displacement-based forms of elastic wave equations are derived and then the forms are discretized using finite difference method. So the new algorithm is called the displacement-based finite difference time domain (DBFDTD). Three numerical examples are computed with this met...

متن کامل

A Hybrid Genetic Algorithm for the Open Shop Scheduling with Makespan and Total Completion Time

Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified...

متن کامل

Energy-efficient multiprocessor scheduling for flow time and makespan

We consider energy-efficient scheduling on multiprocessors, where the speed of each processor can be individually scaled, and a processor consumes power s if it runs at speed s, where α > 1. A scheduling algorithm needs to decide both processor allocations and speeds for a set of parallel jobs whose parallelism can vary with time. The objective is to minimize the sum of overall energy consumpti...

متن کامل

AN EFFICIENT METAHEURISTIC ALGORITHM FOR ENGINEERING OPTIMIZATION: SOPT

Metaheuristic algorithms are well-known optimization tools which have been employed for solving a wide range of optimization problems so far. In the present study, a simple optimization (SOPT) algorithm with two main steps namely exploration and exploitation, is provided for practical applications. Aside from a reasonable rate of convergence attained, the ease in its implementation and dependen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: An International Journal of Optimization and Control: Theories & Applications (IJOCTA)

سال: 2015

ISSN: 2146-5703,2146-0957

DOI: 10.11121/ijocta.01.2015.00260